A* Search Algorithm is an informed search algorithm that finds the shortest path between nodes by combining the cost to reach the node (g(n)) and the estimated cost to reach the goal (h(n)). It uses the evaluation function f(n) = g(n) + h(n) to determine which node to explore next.
Cost Function (g(n)): The actual cost from the start node to the current node.
Heuristic Function (h(n)): Estimates the cost from the current node to the goal.
Evaluation Function (f(n)): The sum of g(n) and h(n), used to determine the next node to explore.
Goal Vector: undefined
Open Set: []
Closed Set: []
Current Node: undefined
Next Node: undefined
Currently visitable nodes: undefined
Path Cost g(n): undefined
Heuristic Cost h(n): undefined
Total Cost f(n): undefined
Parent Node: undefined